RaSE: A Variable Screening Framework via Random Subspace Ensembles

نویسندگان

چکیده

Variable screening methods have been shown to be effective in dimension reduction under the ultra-high dimensional setting. Most existing are designed rank predictors according their individual contributions response. As a result, variables that marginally independent but jointly dependent with response could missed. In this work, we propose new framework for variable screening, random subspace ensemble (RaSE), which works by evaluating quality of subspaces may cover multiple predictors. This can naturally combined any evaluation criterion, leads an array methods. The is capable identify signals no marginal effect or high-order interaction effects. It enjoy sure property and consistency. We also develop iterative version RaSE theoretical support. Extensive simulation studies real-data analysis show effectiveness framework.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust multiple-instance learning ensembles using random subspace instance selection

Many real-world pattern recognition problems can be modeled using multiple-instance learning (MIL), where instances are grouped into bags, and each bag is assigned a label. State-of-the-art MIL methods provide a high level of performance when strong assumptions are made regarding the underlying data distributions, and the proportion of positive to negative instances in positive bags. In this pa...

متن کامل

Choosing Parameters for Random Subspace Ensembles for fMRI Classification

Functional magnetic resonance imaging (fMRI) is a noninvasive and powerful method for analysis of the operational mechanisms of the brain. fMRI classification poses a severe challenge because of the extremely large feature-to-instance ratio. Random Subspace ensembles (RS) have been found to work well for such data. To enable a theoretical analysis of RS ensembles, we assume that only a small (k...

متن کامل

Bica and Random Subspace Ensembles for Dna Microarray-based Diagnosis

We compare two ensemble methods to classify DNA microarray data. The methods use different strategies to face the course of dimensionality plaguing these data. One of them projects data along random coordinates, the other compresses them into independent boolean variables. Both result in random feature extraction procedures, feeding SVMs as base learners for a majority voting ensemble classifie...

متن کامل

Random subspace ensembles for the bio-molecular diagnosis of tumors

The bio-molecular diagnosis of malignancies, based on DNA microarray biotechnologies, is a difficult learning task, because of the high dimensionality and low cardinality of the data. Many supervised learning techniques, among them support vector machines (SVMs), have been experimented, using also feature selection methods to reduce the dimensionality of the data. In this paper we investigate a...

متن کامل

Combining Bagging, Boosting and Random Subspace Ensembles for Regression Problems

Bagging, boosting and random subspace methods are well known re-sampling ensemble methods that generate and combine a diversity of learners using the same learning algorithm for the base-regressor. In this work, we built an ensemble of bagging, boosting and random subspace methods ensembles with 8 sub-regressors in each one and then an averaging methodology is used for the final prediction. We ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the American Statistical Association

سال: 2021

ISSN: ['0162-1459', '1537-274X', '2326-6228', '1522-5445']

DOI: https://doi.org/10.1080/01621459.2021.1938084